public class MyCircularQueue {
    private int[] elem;
    public int front;
    public int rear;

    public MyCircularQueue(int k) {
        this.elem = new int[k+1];
    }

    public boolean enQueue(int value){
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1)%elem.length;
        return true;
    }

    public boolean deQueue(){
        if(isEmpty()){
            return false;
        }
        elem[front] = 0;
        front = (front+1)%elem.length;
        return true;
    }

    public int Front(){
        if(isEmpty()){
            return -1;
        }
        return elem[front];
    }

    public int Rear(){
        if(isEmpty()){
            return -1;
        }
        if(rear == 0){
            return elem[elem.length-1];
        }
        return elem[rear-1];
    }

    public boolean isFull(){
        return (rear+1)%elem.length == front;
    }
    public boolean isEmpty(){
        return front == rear;
    }
}
